Automatically enhancing locality for tree traversals with traversal splicing
نویسندگان
چکیده
منابع مشابه
Locality-enhancing loop transformations for parallel tree traversal algorithms
Exploiting locality is critical to achieving good performance. For regular programs, which operate on dense arrays and matrices, techniques such as loop interchange and tiling have long been known to improve locality and deliver improved performance. However, there has been relatively little work investigating similar locality-improving transformations for irregular programs that operate on tre...
متن کاملOptimal concurrent tree traversals
We present global and local algorithms for generating traversals of arbitrary trees with the property that the maximum number of edges between successive nodes in any traversal is three, and that this is the best possible result. We describe the application of such traversals to parallel computing.
متن کاملTree traversals with task-memory affinities
We study the complexity of traversing tree-shaped workflows whose tasks require large I/O files. We target a heterogeneous architecture with two resource types, each with a different memory, such as a multicore node equipped with a dedicated accelerator (FPGA or GPU). The tasks in the workflow are colored according to their type and can be processed if all their input and output files can be st...
متن کاملEnhancing OpenMP With Features for Locality
OpenMP is a set of directives extending Fortran and C which provide a shared memory programming interface for shared-address space machines. However, there are no directives for controlling the locality of data. Such control can critically affect performance on machines which exhibit non-uniform memory access times. In this paper, we present a set of extensions to OpenMP to provide support for ...
متن کاملMerkle Tree Traversal Revisited
We propose a new algorithm for computing authentication paths in the Merkle signature scheme. Compared to the best algorithm for this task, our algorithm reduces the worst case running time considerably.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2012
ISSN: 0362-1340,1558-1160
DOI: 10.1145/2398857.2384643